Search Bias in Constructive Metaheuristics and Implications for Ant Colony Optimisation
نویسندگان
چکیده
Constructive metaheuristics explore a tree of constructive decisions, the topology of which is determined by the way solutions are represented and constructed. Some solution representations allow particular solutions to be reached on a greater number of paths in this construction tree than other solutions, which can introduce a bias to the search. A bias can also be introduced by the topology of the construction tree. This is particularly the case in problems where certain solution representations are infeasible. This paper presents an examination of the mechanisms that determine the topologies of construction trees and the implications for ant colony optimisation. The results provide insights into why certain assignment orders perform better in problems such as the quadratic and generalised assignment problems, in terms of both solution quality and avoiding infeasible solutions.
منابع مشابه
Adding diversity to two multiobjective constructive metaheuristics for time and space assembly line balancing
We present a new mechanism to introduce diversity into two multiobjective approaches based on ant colony optimisation and randomised greedy algorithms to solve a more realistic extension of a classical industrial problem: time and space assembly line balancing. Promising results are shown after applying the designed constructive metaheuristics to ten real-like problem instances.
متن کاملStructural Advantages for Ant Colony Optimisation Inherent in Permutation Scheduling Problems
When using a constructive search algorithm, solutions to scheduling problems such as the job shop and open shop scheduling problems are typically represented as permutations of the operations to be scheduled. The combination of this representation and the use of a constructive algorithm introduces a bias typically favouring good solutions. When ant colony optimisation is applied to these proble...
متن کاملAnt colony optimisation : a proposed solution framework for the capacitated facility location problem
This thesis is a critical investigation into the development, application and evaluation of ant colony optimisation metaheuristics, with a view to solving a class of capacitated facility location problems. The study is comprised of three phases. The first sets the scene and motivation for research, which includes; key concepts of ant colony optimisation, a review of published academic materials...
متن کاملA comparative study on multiobjective metaheuristics for solving constrained in-core fuel management optimisation problems
In this paper, the topic of constrained multiobjective in-core fuel management optimisation (MICFMO) using metaheuristics is considered. Several modern and stateof-the-art metaheuristics from different classes, including evolutionary algorithms, local search algorithms, swarm intelligence algorithms, a probabilistic model-based algorithm and a harmony search algorithm, are compared in order to ...
متن کاملReal-time rescheduling metaheuristic algorithms applied to FMS with routing flexibility
This paper presents the results of a simulation study of a typical flexible manufacturing system that consists of seven machining centres, a loading and an unloading area, and six different part types. Owing to the existence of identical machining centres, the part types have alternative routings (their number varies between two and eight). One of the objectives of this work is to show how the ...
متن کامل